Generalized probabilistic satisfiability through integer programming
نویسندگان
چکیده
منابع مشابه
Probabilistic Satisfiability and Coherence Checking through Integer Programming
This paper presents algorithms based on integer programming, both for probabilistic satisfiability and coherence checking. That is, we consider probabilistic assessments for both standard probability measures (Kolmogorovian setup) and full conditional measures (de Finettian coherence setup), and in both cases verify satisfiability/coherence using integer programming. We present empirical evalua...
متن کاملClassical Generalized Probabilistic Satisfiability
We analyze a classical generalized probabilistic satisfiability problem (GGenPSAT) which consists in deciding the satisfiability of Boolean combinations of linear inequalities involving probabilities of classical propositional formulas. GGenPSAT coincides precisely with the satisfiability problem of the probabilistic logic of Fagin et al. and was proved to be NP-complete. Here, we present a pol...
متن کاملBounds for probabilistic integer programming problems
We consider stochastic integer programming problems with probabilistic constraints. The concept of a p-efficient point of a probability distribution is used to derive various equivalent problem formulations. Next we introduce new methods for constructing lower and upper bounds for probabilistically constrained integer programs. We also show how limited information about the distribution can be ...
متن کاملOn Stochastic Integer Programming under Probabilistic Constraints
We consider stochastic programming problems with probabilistic constraints in volving integer valued random variables The concept of p e cient points of a prob ability distribution is used to derive various equivalent problem formulations Next we modify the concept of r concave discrete probability distributions and analyse its relevance for problems under consideration These notions are used t...
متن کاملSatisfiability-Based Algorithms for 0-1 Integer Programming
In this paper we describe two Propositional Satisfiability-based algorithms for solving 0-1 integer linear programs (ILP). The algorithms are specifically targeted at ILP instances that are highly constrained, i.e. instances for which the constraints are hard to satisfy. The two algorithms are based on recent algorithms for solving instances of Propositional Satisfiability (SAT) which are also ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Brazilian Computer Society
سال: 2015
ISSN: 0104-6500,1678-4804
DOI: 10.1186/s13173-015-0028-x